No directed fractal percolation in zero area

We show that fractal (or "Mandelbrot") percolation in two dimensions produces a set containing no directed paths, when the set produced has zero area. This improves a similar result by the first author in the case of constant retention probabilities to the case of retention probabilities approaching 1

Invaded cluster algorithm for equilibrium critical points

A new cluster algorithm based on invasion percolation is described. The algorithm samples the critical point of a spin system without a priori knowledge of the critical temperature and provides an efficient way to determine the critical temperature and other observables in the critical region. The method is illustrated for the two- and three-dimensional Ising models. The algorithm equilibrates spin configurations much faster than the closely related Swendsen-Wang algorithm.Comment: 13 pages RevTex and 4 Postscript figures. Submitted to Phys. Rev. Lett. Replacement corrects problem in printing figure

Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing

We consider sequences of graphs and define various notions of convergence related to these sequences: ``left convergence'' defined in terms of the densities of homomorphisms from small graphs into the graphs of the sequence, and ``right convergence'' defined in terms of the densities of homomorphisms from the graphs of the sequence into small graphs; and convergence in a suitably defined metric. In Part I of this series, we show that left convergence is equivalent to convergence in metric, both for simple graphs, and for graphs with nodeweights and edgeweights. One of the main steps here is the introduction of a cut-distance comparing graphs, not necessarily of the same size. We also show how these notions of convergence provide natural formulations of Szemeredi partitions, sampling and testing of large graphs.Comment: 57 pages. See also http://research.microsoft.com/~borgs/. This version differs from an earlier version from May 2006 in the organization of the sections, but is otherwise almost identica

Revisiting the Theory of Finite Size Scaling in Disordered Systems: \nu Can Be Less Than 2/d

For phase transitions in disordered systems, an exact theorem provides a bound on the finite size correlation length exponent: \nu_{FS}<= 2/d. It is believed that the true critical exponent \nu of a disorder induced phase transition satisfies the same bound. We argue that in disordered systems the standard averaging introduces a noise, and a corresponding new diverging length scale, characterized by \nu_{FS}=2/d. This length scale, however, is independent of the system's own correlation length \xi. Therefore \nu can be less than 2/d. We illustrate these ideas on two exact examples, with \nu < 2/d. We propose a new method of disorder averaging, which achieves a remarkable noise reduction, and thus is able to capture the true exponents.Comment: 4 pages, Latex, one figure in .eps forma

Degree Distribution of Competition-Induced Preferential Attachment Graphs

We introduce a family of one-dimensional geometric growth models, constructed iteratively by locally optimizing the tradeoffs between two competing metrics, and show that this family is equivalent to a family of preferential attachment random graph models with upper cutoffs. This is the first explanation of how preferential attachment can arise from a more basic underlying mechanism of local competition. We rigorously determine the degree distribution for the family of random graph models, showing that it obeys a power law up to a finite threshold and decays exponentially above this threshold. We also rigorously analyze a generalized version of our graph process, with two natural parameters, one corresponding to the cutoff and the other a ``fertility'' parameter. We prove that the general model has a power-law degree distribution up to a cutoff, and establish monotonicity of the power as a function of the two parameters. Limiting cases of the general model include the standard preferential attachment model without cutoff and the uniform attachment model.Comment: 24 pages, one figure. To appear in the journal: Combinatorics, Probability and Computing. Note, this is a long version, with complete proofs, of the paper "Competition-Induced Preferential Attachment" (cond-mat/0402268

Monte Carlo study of the Widom-Rowlinson fluid using cluster methods

The Widom-Rowlinson model of a fluid mixture is studied using a new cluster algorithm that is a generalization of the invaded cluster algorithm previously applied to Potts models. Our estimate of the critical exponents for the two-component fluid are consistent with the Ising universality class in two and three dimensions. We also present results for the three-component fluid.Comment: 13 pages RevTex and 2 Postscript figure

Quantal Density Functional Theory of Degenerate States

The treatment of degenerate states within Kohn-Sham density functional theory (KS-DFT) is a problem of longstanding interest. We propose a solution to this mapping from the interacting degenerate system to that of the noninteracting fermion model whereby the equivalent density and energy are obtained via the unifying physical framework of quantal density functional theory (Q-DFT). We describe the Q-DFT of \textit{both} ground and excited degenerate states, and for the cases of \textit{both} pure state and ensemble v-representable densities. This then further provides a rigorous physical interpretation of the density and bidensity energy functionals, and of their functional derivatives, of the corresponding KS-DFT. We conclude with examples of the mappings within Q-DFT.Comment: 10 pages. minor changes made. to appear in PR